منابع مشابه
Analysis of Jackson networks with infinite supply and unreliable nodes
Jackson networks are versatile models for analyzing complex networks. In this paper we study generalized Jackson networks with single-server stations, where nodes may have an infinite supply of work. We allow simultaneous breakdown of servers and consider group repair strategies. We establish the existence of a steadystate distribution of the queue-length vector at stable nodes for different ty...
متن کاملLocal Stabilization of Non-Ergodic Jackson Networks with Unreliable Nodes
This thesis contributes to a better understanding of the behavior of queueing networksthat cannot approach a classical equilibrium state.We consider Jackson networks with unreliable nodes which randomly break down andare under repair for a random time. Our networks are described by Markov processesthe states of which incorporate the availability status and the queue-lengths vect...
متن کاملCommunication and Compression in Dense Networks of Unreliable Nodes
Communication and Compression in Dense Networks of Unreliable Nodes The drive toward the implementation and massive deployment of wireless sensor networks calls for ultra-low-cost, low-power and ever smaller nodes. While the digital subsystems of the nodes are still experiencing exponential reduction of all of these metrics as described by Moore's Law, there is no such trend regarding the perfo...
متن کاملNetworks with Unreliable Nodes and Edges: Monte Carlo Lifetime Estimation
Estimating the lifetime distribution of computer networks in which nodes and links exist in time and are bound for failure is very useful in various applications. This problem is known to be NP-hard. In this paper we present efficient combinatorial approaches to Monte Carlo estimation of network lifetime distribution. We also present some simulation results. Keywords—Combinatorial spectrum, Mon...
متن کاملEffect of Unreliable Nodes on QoS Routing
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections’ QoS request, while simultaneously utilizing network resources efficiently. However, these routing algorithms and the guarantees they provide do not consider the possibility of node and link failures. The failure of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2016
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s026996481600005x